TSTP Solution File: ITP210^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP210^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:16:53 EDT 2024
% Result : Theorem 3.27s 2.06s
% Output : CNFRefutation 3.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 115 ( 42 equ; 0 cnn)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 258 ( 23 ~; 19 |; 42 &; 170 @)
% ( 2 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 30 ^ 0 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
produc3658429121746597890et_nat: $tType ).
thf(decl_sort2,type,
assn: $tType ).
thf(decl_26,type,
abs_assn: ( produc3658429121746597890et_nat > $o ) > assn ).
thf(decl_27,type,
rep_assn: assn > produc3658429121746597890et_nat > $o ).
thf(decl_1500,type,
x: assn ).
thf(decl_1501,type,
y: assn ).
thf(decl_1744,type,
esk208_0: produc3658429121746597890et_nat ).
thf(decl_1767,type,
esk231_0: produc3658429121746597890et_nat ).
thf(conj_0,conjecture,
( ( ( x
= ( abs_assn
@ ^ [X9: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ X9 )
& ( rep_assn @ y @ X9 ) ) ) )
& ( x != y ) )
<=> ( ( x
= ( abs_assn
@ ^ [X9: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ X9 )
& ( rep_assn @ y @ X9 ) ) ) )
& ( y
!= ( abs_assn
@ ^ [X9: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ X9 )
& ( rep_assn @ x @ X9 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
& ( x != y ) )
<=> ( ( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
& ( y
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])]) ).
thf(c_0_2,negated_conjecture,
( ( ( x
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
| ( x = y )
| ( x
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
| ( y
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) ) ) )
& ( ( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
| ( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) ) )
& ( ( y
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) ) )
| ( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) ) )
& ( ( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
| ( x != y ) )
& ( ( y
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) ) )
| ( x != y ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
thf(c_0_3,negated_conjecture,
( ( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
| ( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( y
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) ) )
| ( x != y ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( x
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
( ( ( ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) )
!= ( ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
| ( y != x ) ),
inference(ext_sup,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( x = y )
| ( y
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) ) )
| ( x
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) )
| ( x
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,plain,
( ( ( ( rep_assn @ y @ esk208_0 )
& ( rep_assn @ x @ esk208_0 ) )
<~> ( ( rep_assn @ x @ esk208_0 )
& ( rep_assn @ y @ esk208_0 ) ) )
| ( y != x ) ),
inference(neg_ext,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( y = x )
| ( y
= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) ) )
| ( x
!= ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
( ( rep_assn @ x @ esk208_0 )
| ( y != x ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8])]) ).
thf(c_0_11,plain,
( ( rep_assn @ y @ esk208_0 )
| ( y != x ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8])]) ).
thf(c_0_12,negated_conjecture,
( ( ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) )
= y )
| ( y = x ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_5])]) ).
thf(c_0_13,plain,
y != x,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8])]),c_0_10]),c_0_11]) ).
thf(c_0_14,negated_conjecture,
( ( abs_assn
@ ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) )
= y ),
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_15,plain,
( ( ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ y @ Z0 )
& ( rep_assn @ x @ Z0 ) ) )
!= ( ^ [Z0: produc3658429121746597890et_nat] :
( ( rep_assn @ x @ Z0 )
& ( rep_assn @ y @ Z0 ) ) ) ),
inference(sr,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_14,c_0_5]),c_0_13]) ).
thf(c_0_16,plain,
( ( ( rep_assn @ y @ esk231_0 )
& ( rep_assn @ x @ esk231_0 ) )
<~> ( ( rep_assn @ x @ esk231_0 )
& ( rep_assn @ y @ esk231_0 ) ) ),
inference(neg_ext,[status(thm)],[c_0_15]) ).
thf(c_0_17,plain,
rep_assn @ y @ esk231_0,
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_16])]) ).
thf(c_0_18,plain,
rep_assn @ x @ esk231_0,
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_16])]) ).
thf(c_0_19,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_16])]),c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ITP210^1 : TPTP v8.2.0. Released v8.1.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 17:29:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.27/2.06 # Version: 3.1.0-ho
% 3.27/2.06 # partial match(3): HMLLSMSLSSMCHSA
% 3.27/2.06 # Preprocessing class: HMLLSLLLSSLCHSA.
% 3.27/2.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.27/2.06 # Starting new_ho_10 with 1500s (5) cores
% 3.27/2.06 # Starting sh5l with 300s (1) cores
% 3.27/2.06 # Starting new_bool_1 with 300s (1) cores
% 3.27/2.06 # Starting new_bool_2 with 300s (1) cores
% 3.27/2.06 # new_bool_1 with pid 22168 completed with status 0
% 3.27/2.06 # Result found by new_bool_1
% 3.27/2.06 # partial match(3): HMLLSMSLSSMCHSA
% 3.27/2.06 # Preprocessing class: HMLLSLLLSSLCHSA.
% 3.27/2.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.27/2.06 # Starting new_ho_10 with 1500s (5) cores
% 3.27/2.06 # Starting sh5l with 300s (1) cores
% 3.27/2.06 # Starting new_bool_1 with 300s (1) cores
% 3.27/2.06 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.27/2.06 # Search class: HGHSM-FSLM32-DHSFFSBN
% 3.27/2.06 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.27/2.06 # Starting full_lambda_3 with 139s (1) cores
% 3.27/2.06 # full_lambda_3 with pid 22171 completed with status 0
% 3.27/2.06 # Result found by full_lambda_3
% 3.27/2.06 # partial match(3): HMLLSMSLSSMCHSA
% 3.27/2.06 # Preprocessing class: HMLLSLLLSSLCHSA.
% 3.27/2.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.27/2.06 # Starting new_ho_10 with 1500s (5) cores
% 3.27/2.06 # Starting sh5l with 300s (1) cores
% 3.27/2.06 # Starting new_bool_1 with 300s (1) cores
% 3.27/2.06 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.27/2.06 # Search class: HGHSM-FSLM32-DHSFFSBN
% 3.27/2.06 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.27/2.06 # Starting full_lambda_3 with 139s (1) cores
% 3.27/2.06 # Preprocessing time : 0.021 s
% 3.27/2.06
% 3.27/2.06 # Proof found!
% 3.27/2.06 # SZS status Theorem
% 3.27/2.06 # SZS output start CNFRefutation
% See solution above
% 3.27/2.06 # Parsed axioms : 11329
% 3.27/2.06 # Removed by relevancy pruning/SinE : 10672
% 3.27/2.06 # Initial clauses : 993
% 3.27/2.06 # Removed in clause preprocessing : 23
% 3.27/2.06 # Initial clauses in saturation : 970
% 3.27/2.06 # Processed clauses : 1560
% 3.27/2.06 # ...of these trivial : 112
% 3.27/2.06 # ...subsumed : 569
% 3.27/2.06 # ...remaining for further processing : 878
% 3.27/2.06 # Other redundant clauses eliminated : 370
% 3.27/2.06 # Clauses deleted for lack of memory : 0
% 3.27/2.06 # Backward-subsumed : 17
% 3.27/2.06 # Backward-rewritten : 23
% 3.27/2.06 # Generated clauses : 14563
% 3.27/2.06 # ...of the previous two non-redundant : 12666
% 3.27/2.06 # ...aggressively subsumed : 0
% 3.27/2.06 # Contextual simplify-reflections : 8
% 3.27/2.06 # Paramodulations : 12270
% 3.27/2.06 # Factorizations : 28
% 3.27/2.06 # NegExts : 39
% 3.27/2.06 # Equation resolutions : 382
% 3.27/2.06 # Disequality decompositions : 0
% 3.27/2.06 # Total rewrite steps : 3727
% 3.27/2.06 # ...of those cached : 2906
% 3.27/2.06 # Propositional unsat checks : 0
% 3.27/2.06 # Propositional check models : 0
% 3.27/2.06 # Propositional check unsatisfiable : 0
% 3.27/2.06 # Propositional clauses : 0
% 3.27/2.06 # Propositional clauses after purity: 0
% 3.27/2.06 # Propositional unsat core size : 0
% 3.27/2.06 # Propositional preprocessing time : 0.000
% 3.27/2.06 # Propositional encoding time : 0.000
% 3.27/2.06 # Propositional solver time : 0.000
% 3.27/2.06 # Success case prop preproc time : 0.000
% 3.27/2.06 # Success case prop encoding time : 0.000
% 3.27/2.06 # Success case prop solver time : 0.000
% 3.27/2.06 # Current number of processed clauses : 750
% 3.27/2.06 # Positive orientable unit clauses : 165
% 3.27/2.06 # Positive unorientable unit clauses: 13
% 3.27/2.06 # Negative unit clauses : 50
% 3.27/2.06 # Non-unit-clauses : 522
% 3.27/2.06 # Current number of unprocessed clauses: 12047
% 3.27/2.06 # ...number of literals in the above : 37696
% 3.27/2.06 # Current number of archived formulas : 0
% 3.27/2.06 # Current number of archived clauses : 50
% 3.27/2.06 # Clause-clause subsumption calls (NU) : 54191
% 3.27/2.06 # Rec. Clause-clause subsumption calls : 36905
% 3.27/2.06 # Non-unit clause-clause subsumptions : 382
% 3.27/2.06 # Unit Clause-clause subsumption calls : 12435
% 3.27/2.06 # Rewrite failures with RHS unbound : 0
% 3.27/2.06 # BW rewrite match attempts : 1809
% 3.27/2.06 # BW rewrite match successes : 279
% 3.27/2.06 # Condensation attempts : 1560
% 3.27/2.06 # Condensation successes : 44
% 3.27/2.06 # Termbank termtop insertions : 899676
% 3.27/2.06 # Search garbage collected termcells : 121877
% 3.27/2.06
% 3.27/2.06 # -------------------------------------------------
% 3.27/2.06 # User time : 0.620 s
% 3.27/2.06 # System time : 0.058 s
% 3.27/2.06 # Total time : 0.678 s
% 3.27/2.06 # Maximum resident set size: 33116 pages
% 3.27/2.06
% 3.27/2.06 # -------------------------------------------------
% 3.27/2.06 # User time : 1.466 s
% 3.27/2.06 # System time : 0.092 s
% 3.27/2.06 # Total time : 1.558 s
% 3.27/2.06 # Maximum resident set size: 27592 pages
% 3.27/2.06 % E---3.1 exiting
% 3.27/2.06 % E exiting
%------------------------------------------------------------------------------